var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=label:(d_j01|sda_j02)&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=label:(d_j01|sda_j02)&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=label:(d_j01|sda_j02)&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2001\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n N. Al-Dhahir; and S N. Diggavi.\n\n\n \n \n \n \n Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference.\n \n \n \n\n\n \n\n\n\n IEEE Communication Letters, 5(6): 233–235. June 2001.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{ADj01,\n abstract = {Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M<N (where N is the rank of the signal and M is dimension of the space) then the worst interferer is shown to put its power along the M largest eigendirections of the signal.},\n author = {N. Al-Dhahir and S N. Diggavi},\n file = {:papers:ps:nbi.pdf},\n journal = {IEEE Communication Letters},\n label = {ad_j01},\n month = {June},\n note = {},\n number = {6},\n pages = {233--235},\n tags = {journal,WorstNoise,RobComm,IT},\n title = {Maximum Throughput Loss of Noisy ISI Channels Due to Narrowband Interference},\n type = {2},\n volume = {5},\n year = {2001}\n}\n\n
\n
\n\n\n
\n Narrowband interference (NBI) could occur in transmission media such as twisted pair or coaxial cable. We analyzed the effect of such interference on the data throughput for finite-blocklength transmission over noisy inter-symbol interference channels. It was shown that the worst narrowband interference spreads its power over the “sweet spots” of the signal (i.e. where the signal puts highest power). More precisely, the auto-correlation matrix of worst-case narrowband (rank-deficient) interference is shown to have the same eigendirections as the signal. Moreover, if the rank of the covariance matrix of the NBI is M\n\n\n
\n\n\n
\n \n\n \n \n S N. Diggavi.\n\n\n \n \n \n \n On achievable performance over spatial diversity fading channels.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 47(1): 308–325. January 2001.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{Dj01,\n abstract = {This is an early study of the capacity of MIMO channels inspired by the work\nof Telatar and Foschini. It shows that the capacity grows linearly in the number of transmit\nand receive antennas (degrees of freedom) either when the SNR becomes large or when\nthe number of antennas in the MIMO system becomes large. It shows that the linear rate\ngrowth can be achieved by simpler linear detector structures, such as a matched filter\nreceiver. However, it shows that the price paid for simple matched filter receivers is that\nthe SNR growth flattens. It also examines the case where the channel matrix has a \nconstant expected Frobenius norm. In this case, even with isotropic fading, it is shown that\nthe capacity of MIMO channels does not grow linear in the number of antennas, but grows\nlinearly in SNR. Finally, the effect of time-variation within a transmission block for ISI fading\nchannels is examined in terms of capacity.},\n author = {S N. Diggavi},\n file = {:papers:ps:fading.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {d_j01},\n month = {January},\n note = {},\n number = {1},\n pages = {308--325},\n tags = {journal,MIMO,,STcodes,IT,STWC},\n title = {On achievable performance over spatial diversity fading channels},\n type = {2},\n volume = {47},\n year = {2001}\n}\n\n
\n
\n\n\n
\n This is an early study of the capacity of MIMO channels inspired by the work of Telatar and Foschini. It shows that the capacity grows linearly in the number of transmit and receive antennas (degrees of freedom) either when the SNR becomes large or when the number of antennas in the MIMO system becomes large. It shows that the linear rate growth can be achieved by simpler linear detector structures, such as a matched filter receiver. However, it shows that the price paid for simple matched filter receivers is that the SNR growth flattens. It also examines the case where the channel matrix has a constant expected Frobenius norm. In this case, even with isotropic fading, it is shown that the capacity of MIMO channels does not grow linear in the number of antennas, but grows linearly in SNR. Finally, the effect of time-variation within a transmission block for ISI fading channels is examined in terms of capacity.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);